A fast algorithm for finding point sources in theFermidata stream: FermiFAST
نویسندگان
چکیده
منابع مشابه
A Fast and Efficient Algorithm for Finding Frequent Items over Data Stream
We investigate the problem of finding the frequent items in a continuous data stream. We present an algorithm called λ-Count for computing frequency counts over a user specified threshold on a data stream. To emphasize the importance of the more recent data items, a fading factor is used. Our algorithm can detect εapproximate frequent items of a data stream using O(logλε) memory space and O(1...
متن کاملA Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators
In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...
متن کاملA fast parallel algorithm for finding the convex hull of a sorted point set
We present a parallel algorithm for nding the convex hull of a sorted point set. The algorithm runs in O(log log n) (doubly logarithmic) time using n= log logn processors on a Common CRCW PRAM. To break the (log n= loglog n) time barrier required to output the convex hull in a contiguous array, we introduce a novel data structure for representing the convex hull. The algorithm is optimal in two...
متن کاملA fast point-based algorithm for POMDPs
We describe a point-based approximate value iteration algorithm for partially observable Markov decision processes. The algorithm performs value function updates ensuring that in each iteration the new value function is an upper bound to the previous value function, as estimated on a sampled set of belief points. A randomized belief-point selection scheme allows for fast update steps. Results i...
متن کاملA Fast Algorithm for Point Labeling Problem
In the map labeling problem, we are given a set P = {p1, p2, . . . , pn} of point sites distributed on a 2D map. The label of a point pi is an axis-parallel rectangle of specified size. The objective is to label maximum number of points on the map so that the placed labels are mutually non-overlapping. Here, we investigate a special class of map labeling problem where (i) the height of the labe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 2016
ISSN: 0035-8711,1365-2966
DOI: 10.1093/mnras/stw3220